Operational Equivalence of Graph Transformation Systems
نویسندگان
چکیده
Graph transformation systems (GTS) provide an important theory for numerous applications. With the growing number of GTSbased applications the comparison of operational equivalence of two GTS becomes an important area of research. This work introduces a notion of operational equivalence for graph transformation systems. The embedding of GTS in constraint handling rules (CHR) provides the basis for a decidable and sufficient criterion for operational equivalence of GTS. It is based on the operational equivalence test for CHR programs. A direct application of adapting this test to GTS allows automatic removal of redundant rules.
منابع مشابه
Permutation Equivalence of DPO Derivations with Negative Application Conditions based on Subobject Transformation Systems
Switch equivalence for transformation systems has been successfully used in many domains for the analysis of concurrent behaviour. When using graph transformation as modelling framework for these systems, the concept of negative application conditions (NACs) is widely used – in particular for the specification of operational semantics. In this paper we show that switch equivalence can be improv...
متن کاملForschungsberichte der Fakultät IV – Elektrotechnik und Informatik Permutation Equivalence of DPO Derivations with Negative Application Conditions based on Subobject Transformation Systems (Long Version)
Switch equivalence for transformation systems has been successfully used in many domains for the analysis of concurrent behaviour. When using graph transformation as modelling framework for these systems, the concept of negative application conditions (NACs) is widely used – in particular for the specification of operational semantics. In this paper we show that switch equivalence can be improv...
متن کاملThe graph of equivalence classes and Isoclinism of groups
Let $G$ be a non-abelian group and let $Gamma(G)$ be the non-commuting graph of $G$. In this paper we define an equivalence relation $sim$ on the set of $V(Gamma(G))=Gsetminus Z(G)$ by taking $xsim y$ if and only if $N(x)=N(y)$, where $ N(x)={uin G | x textrm{ and } u textrm{ are adjacent in }Gamma(G)}$ is the open neighborhood of $x$ in $Gamma(G)$. We introduce a new graph determined ...
متن کاملENTROPY OF DYNAMICAL SYSTEMS ON WEIGHTS OF A GRAPH
Let $G$ be a finite simple graph whose vertices and edges are weighted by two functions. In this paper we shall define and calculate entropy of a dynamical system on weights of the graph $G$, by using the weights of vertices and edges of $G$. We examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. At the end it is shown that, for $rin [0,+infty]$, t...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کامل